In Vitro Implementation of k-shortest Paths Computation with Graduated PCR

نویسندگان

  • Zuwairie Ibrahim
  • Yusei Tsuboi
  • Osamu Ono
  • Marzuki Khalid
چکیده

In this paper, an in vitro implementation of DNA computing for solving k-shortest paths problem of a weighted graph is reported. The encoding is designed in such a way that every path is encoded by oligonucleotides and the length of the path is directly proportional to the length of oligonucleotides. For initial pool generation, parallel overlap assembly is employed for efficient generation of all candidate answers. After the initial solution is subjected to amplification by polymerase chain reaction (PCR), k-shortest paths could be visualized by polyacrylamide gel electrophoresis (PAGE) and the selection can be done. The visualization of the output, in fact, relies on the appearance of DNA bands on a gel image. Further, it is shown that a method called graduated PCR is a good subsequent bio-molecular reaction for obtaining molecular information hidden in the output DNA. Graduated PCR is also crucial to prove the correctness of the in vitro computation. The experimental results show the effectiveness of the proposed DNA-based computation and prove that the k-shortest paths problem has been successfully solved on a DNA computer.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient time and space K point-to-point shortest simple paths algorithm

We address the problem identifying the K best point-to-point simple paths connecting a given pair of nodes in a directed network with arbitrary lengths. The main result in this paper is the proof that a path tree containing the kth point-to-point shortest simple path can be obtained by using one of the previous (k-1) path trees containing each one of the previous (k-1) best point-to-point short...

متن کامل

Parallel Algorithms for the K Shortest Paths and Related Problems Parallel Algorithms for the K Shortest Paths and Related Problems

A parallel algorithm is developed to nd the k shortest paths between pairs of vertices in an edge-weighted directed graph. The concurrent-read exclusive-write PRAM is used as the model of computation. The algorithm computes an implicit representation of the k shortest paths to a given destination vertex from each vertex of a graph with n vertices and m edges, using O(m + nk log 2 k) work and O(...

متن کامل

General Parallel Computation on Commodity Graphics Hardware: Case Study with the All-Pairs Shortest Paths Problem

Programmability and IEEE-standard floating point arithmetic makes the latest commodity graphics processors (GPUs) an attractive platform for general parallel computing. In this paper we describe the implementation of the Warshall-Floyd algorithm on a class of GPUs. All-pairs shortest paths problem is relevant to many practical applications. Efficient GPU implementation of the Warshall-Floyd alg...

متن کامل

Single-Source Shortest Paths with the Parallel Boost Graph Library

The Parallel Boost Graph Library (Parallel BGL) is a library of graph algorithms and data structures for distributed-memory computation on large graphs. Developed with the Generic Programming paradigm, the Parallel BGL is highly customizable, supporting various graph data structures, arbitrary vertex and edge properties, and different communication media. In this paper, we describe the implemen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006